Axelrod’s Metanorm Games on Complex Networks

In this paper we adapt Axelrod’s metanorms model to run on arbitrary interaction structures. We propose a hybrid analytical methodology combining computer simulations with a novel mathematical approach that abstracts some details of evolutionary dynamics while retaining explicit and exact representation of underlying network topology. We construct simple network statistics based on the clustering coefficient and first order degree distribution of the interaction network as strong predictors of the emergence of cooperative norms.